An Improvement of the Beck-Fiala Theorem
نویسنده
چکیده
In 1981 Beck and Fiala proved an upper bound for the discrepancy of a set system of degree d that is independent of the size of the ground set. In the intervening years the bound has been decreased from 2d− 2 to 2d− 4. We improve the bound to 2d− log∗ d. MSC classes: 05D05, 11K38, 05C15
منابع مشابه
Approximation of Multi { Color
In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to c colors. We give a recursive method that constructs c{colorings from approximations to the 2{color discrepancy. This method works for a large class of theorems like the six{standard{deviation theorem of Spencer, the Beck{Fiala theorem and the results of ...
متن کاملApproximation of Multi-color Discrepancy
In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to c colors. We give a recursive method that constructs c{colorings from approximations to the 2{color discrepancy. This method works for a large class of theorems like the six{standard{deviation theorem of Spencer, the Beck{Fiala theorem and the results of ...
متن کاملMulti–color Discrepancies
In this article we introduce combinatorial multi-color discrepancies and generalize several classical results from 2–color discrepancy theory to c colors (c ≥ 2). We give a recursive method that constructs c–colorings from approximations of 2–color discrepancies. This method works for a large class of theorems like the ‘six standard deviations’ theorem of Spencer, the Beck–Fiala theorem, the re...
متن کاملA Beck - Fiala-type Theorem for Euclidean Norms
The inequality in (a) is naturally the best possible. Theorem l(a) is connected with questions such as the Beck-Fiala theorem or the Koml6s conjecture (see [2J, [3J and [7]). Combinatorial motivations are presented exhaustively in [8J (see also [6]). In a slightly different form, Theorem l(a) was used in [IJ in the proof that nuclear Frechet spaces satisfy the Levy-Steinitz theorem on rearrange...
متن کاملApplications of Discrepancy Theory in Multiobjective Approximation unicode
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 2016